Domination and Independent Domination in Extended Supergrid Graphs
نویسندگان
چکیده
Supergrid graphs are derived by computing stitch paths for computerized embroidery machines. In the past, we have studied Hamiltonian-related properties of supergrid and their subclasses graphs. this paper, propose a generalized graph class called extended Extended include grid graphs, diagonal triangular as study problems domination independent on A dominating set is subset vertices it, such that every vertex in or adjacent to at least set. If any two not adjacent, an Domination find with number graph, respectively. The known be NP-complete, meaning these also NP-complete. However, complexities other remain unknown. first prove then, simple extension, addition, rectangular linearly solvable; however, triangular-supergrid This paper provides tight upper bounds sizes minimum sets
منابع مشابه
Independent domination in directed graphs
In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, tr...
متن کاملIndependent transversal domination in graphs
A set S ⊆ V of vertices in a graph G = (V,E) is called a dominating set if every vertex in V −S is adjacent to a vertex in S. A dominating set which intersects every maximum independent set in G is called an independent transversal dominating set. The minimum cardinality of an independent transversal dominating set is called the independent transversal domination number of G and is denoted by γ...
متن کاملIndependent Domination in Cubic Graphs
A set S of vertices in a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S. The independent domination number of G, denoted by i(G), is the minimum cardinality of an independent dominating set. In this paper, we show that if G �= C5 ✷K2 is a connected cubic graph of order n that does not have a subgraph isomorphic to ...
متن کاملPerfect graphs of strong domination and independent strong domination
Let γ(G), i(G), γS(G) and iS(G) denote the domination number, the independent domination number, the strong domination number and the independent strong domination number of a graph G, respectively. A graph G is called γi-perfect (domination perfect) if γ(H) = i(H), for every induced subgraph H of G. The classes of γγS-perfect, γSiS-perfect, iiS-perfect and γiS-perfect graphs are defined analog...
متن کاملGraphs with Equal Domination and Independent Domination Number
A set S of vertices of a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S. The independent domination number of G, denoted by i(G), is the minimum cardinality of an independent dominating set of G. In this paper, some new classes of graphs with equal domination and independent domination numbers are presented and exa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2022
ISSN: ['1999-4893']
DOI: https://doi.org/10.3390/a15110402